A return from the'Land of no Return'

Games of no return a

Let D = (V,A) be a finite directed graph (digraph) each vertex v ∈ V of which is interpreted as a position and each arc a = (v, v′) ∈ A as a possible move from position v to v′. Two players, 1 and 2, take turns moving a token from a given initial position v0. The game ends as soon as the token returns to a position, where it has already been. By definition, the player who made the last move los...

No return to convexity

In the paper we study closures of classes of log–concave measures under taking weak limits, linear transformations and tensor products. We consider what uniform measures on convex bodies can one obtain starting from some class K. In particular we prove that if one starts from one–dimensional log–concave measures, one obtains no non– trivial uniform mesures on convex bodies.

Summarization for termination: no return!

We propose a program analysis method for proving termination of recursive programs. The analysis is based on a reduction of termination to two separate problems: reachability of recursive programs, and termination of non-recursive programs. Our reduction works through a program transformation that modifies the call sites and removes return edges. In the new, non-recursive program, a procedure c...

Summarization For Termination: No Return! (DRAFT)

We propose a program analysis method for proving termination of recursive programs. The analysis is based on a reduction of termination to two separate problems: reachability of recursive programs, and termination of non-recursive programs. Our reduction works through a program transformation that modifies the call sites and removes return edges. In the new, non-recursive program, a procedure c...

Return from Holiday